Linear algebraic methods in communication complexity
نویسندگان
چکیده
منابع مشابه
Algebraic Techniques in Communication Complexity
In this paper we study the gap between the logarithm of the rank of a matrix and its communication complexity. The main contribution of the paper relies on the algebraic interpretation of some methods which yield non constant gaps by combining, mainly via tensor products, matrices with constant gap.
متن کاملCommunication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption schemes, using their homomorphic properties in a black-box way. A few notable examples of such primitives include items like single database Private Information Retrieval (PIR) schemes (introduced in [15]) and private da...
متن کاملAlgebraic Methods in Computational Complexity Dagstuhl Seminar
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are ...
متن کاملOn the Communication Complexity of Linear Algebraic Problems in the Message Passing Model
We study the communication complexity of linear algebraic problems over finite fields in the multiplayer message passing model, proving a number of tight lower bounds. Specifically, for a matrix which is distributed among a number of players, we consider the problem of determining its rank, of computing entries in its inverse, and of solving linear equations. We also consider related problems s...
متن کاملAlgebraic and Combinatorial Methods in Computational Complexity 1 Executive Summary 64 12421 – Algebraic and Combinatorial Methods in Computational Complexity
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2012
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.07.008